MPQ-trees for orthogonal packing problem
نویسندگان
چکیده
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a ”big” rectangular container without overlapping. The rotation of items is not allowed. In this paper we present a new algorithm for solving OPP-2, based on the characterization of solutions using interval graphs proposed by Fekete and Schepers. The algorithm uses MPQ-trees combinatorial structures introduced by Korte and Möhring.
منابع مشابه
MPQ-trees for the Orthogonal Packing Problem
Given a set of rectangular items of different sizes and a rectangular container, the aim of the bi-dimensional Orthogonal Packing Problem (OPP-2 for short) is to decide whether there exists a non-overlapping packing of the items in this container. The rotation of items is not allowed. In this paper we present a new exact algorithm for solving OPP-2, based upon the characterization of solutions ...
متن کاملConstructive algorithms and lower bounds for guillotine cuttable orthogonal bin packing problems
The d-dimensional bin packing problem (OBPP-d) is the problem of finding the minimum number of containers needed to contain a set of orthogonally packed d-dimensional rectangular boxes. In OBPP-d solvers two subproblems are crucial: Calculating lower bounds and solving the decision problem (OPP-d) of determining if a set of boxes can be orthogonally packed into a single container. This thesis f...
متن کاملNew Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem
In this paper, we consider the three-dimensional orthogonal bin packing problem, which is a generalization of the well-known bin packing problem. We present new lower bounds for the problem and demonstrate that they improve the best previous results. The asymptotic worst-case performance ratio of the lower bounds is also proved. In addition, we study the non-oriented model, which allows items t...
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملCanonical Data Structure for Probe Interval Graphs
The class of probe interval graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition algorithms for the graph class are known. However, the complexity of the graph isomorphism problem for the class is still unknown. In this paper, extended MPQ-trees are proposed to represent the probe interval graphs. An...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 36 شماره
صفحات -
تاریخ انتشار 2010